An extension of binary minimisation techniques to ternary equations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Extension to the Local Binary Patterns for Image Retrieval

In this paper, we propose an extension to the local binary patterns for image retrieval. We focus on the spatial distribution information in images, and present a spatial-distribution-information-enhanced local pattern for content-based image retrieval. Differing from traditional local patterns, we group those gray-level varying values according to three directions, and each group is then merge...

متن کامل

An Extension of Sharkovsky’s Theorem to Periodic Difference Equations

We present an extension of Sharkovsky’s Theorem and its converse to periodic difference equations. In addition, we provide a simple method for constructing a p-periodic difference equation having an r-periodic geometric cycle with or without stability properties.

متن کامل

Binary/ternary extreme learning machines

In this paper, a new hidden layer construction method for Extreme Learning Machines (ELMs) is investigated, aimed at generating a diverse set of weights. The paper proposes two new ELM variants: Binary ELM, with a weight initialization scheme based on f0;1g–weights; and Ternary ELM, with a weight initialization scheme based on f 1;0;1g–weights. The motivation behind this approach is that these ...

متن کامل

Ternary Form Equations

Let T be a homogeneous polynomial in three variables and with rational integer coëfficients. As a generalisation of Thue’s equation we consider the ternary form equation T (x, y, z) = 1 in the integral unknowns x, y, z. We prove some general results when the degree of T is at most three and make some modest inroads into the case degT > 3. Generalisations to algebraic number fields are considere...

متن کامل

An Extension to Imprecise Data Envelopment Analysis

The standard data envelopment analysis (DEA) method assumes that the values for inputs and outputs are exact. While DEA assumes exact data, the existing imprecise DEA (IDEA) assumes that the values for some inputs and outputs are only known to lie within bounded intervals, and other data are known only up to an order. In many real applications of DEA, there are cases in which some of the input ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1968

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/11.3.277